Generating SAT Instances from First-Order Formulas
نویسندگان
چکیده
منابع مشابه
Generating SAT Instances from First-Order Formulas
To solve the satisfiability (SAT) problem in propositional logic, many algorithms have been proposed in recent years. However, practical problems are often more naturally described as satisfying a set of first-order formulas. When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT. To facilit...
متن کاملGenerating SAT instances with community structure
Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world, SAT instances. However, the process of development and testing of new SAT solving techniques is conditioned to the finite and reduced number of known industrial benchmarks. Therefore, new models of random SAT instances generation that capture realistically the features of real-world problems can be benefi...
متن کاملGenerating Hard but Solvable SAT Formulas
The 3-SAT problem is one of the well-known NP-hard problems that have been extensively studied over the years. Its generalisation, the k-SAT problem, is NP-complete for k > 2. In addition to being interesting from a theoretical viewpoint, 3-SAT also plays a role in industrial applications, such as boolean circuit verification. It is therefore of special interest to develop efficient solvers for...
متن کاملGenerating Hard SAT/CSP Instances Using Expander Graphs
In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion o...
متن کاملGenerating 'Random' 3-SAT Instances with Specific Solution Space Structure
Generating good benchmarks is important for the evaluation and improvement of any algorithm for NP-hard problems such as the Boolean satisfiability (SAT) problem. Carefully designed benchmarks are also helpful in the study of the nature of NP-completeness . Probably the most well-known and successful story is the discovery of the phase transition phenomenon (Cheeseman, Kanefsky, and Taylor 1991...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2005
ISSN: 1000-9825
DOI: 10.1360/jos160327